منابع مشابه
Minimum resolvable coverings with small parallel classes
For prime power q, we determine the minimum number of parallel classes in a resolvable 2-(kq, L 1) covering for almost all values of k. @ 1999 Elsevier Science B.V. All rights reserved In September 1995 Jan van Haastrecht gave a dinner on the occasion of his retirement. He had invited 20 colleagues. The host and the guests were to be seated at three tables each of which had seven places. The di...
متن کاملConstructions of uniform designs by using resolvable packings and coverings
In this paper, uniform designs are constructed based on nearly U-type designs and the discrete discrepancy. The link between such uniform designs and resolvable packings and coverings in combinatorial design theory is developed. Through resolvable packings and coverings without identical parallel classes, many infinite classes of new uniform designs are then produced.
متن کاملMaximal Resolvable Packings and Minimal Resolvable Coverings of Triples by Quadruples
Determination of maximal resolvable packing number and minimal resolvable covering number is a fundamental problem in designs theory. In this article, we investigate the existence of maximal resolvable packings of triples by quadruples of order v (MRPQS(v)) and minimal resolvable coverings of triples by quadruples of order v (MRCQS(v)). We show that an MRPQS(v) (MRCQS(v)) with the number of blo...
متن کاملAlmost resolvable minimum coverings of complete graphs with 4-cycles
If the complete graph Kn has vertex set X, a minimum covering of Kn with 4-cycles, (X,C, P ), is a partition of the edges of Kn ∪ P into a collection C of 4-cycles, where P is a subgraph of λKn and the number of edges in P is as small as possible. An almost parallel class of a minimum covering of Kn with 4-cycles is a largest possible collection of vertex disjoint 4-cycles (so with n/4 4-cycles...
متن کاملExistence of incomplete resolvable minimum coverings of pairs by triples
For given positive integers u and v with u ≡ v ≡ 0 (mod 6), let IRC(u; v) denote an incomplete resolvable minimum covering of pairs by triples of order u having a hole of size v. It is proved in this paper that there exists such an IRC(u; v) if and only if u¿ 3v. c © 2003 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2003
ISSN: 1063-8539,1520-6610
DOI: 10.1002/jcd.10024